/****************************************************************************
*
*                            Open Watcom Project
*
*    Portions Copyright (c) 1983-2002 Sybase, Inc. All Rights Reserved.
*
*  ========================================================================
*
*    This file contains Original Code and/or Modifications of Original
*    Code as defined in and that are subject to the Sybase Open Watcom
*    Public License version 1.0 (the 'License'). You may not use this file
*    except in compliance with the License. BY USING THIS FILE YOU AGREE TO
*    ALL TERMS AND CONDITIONS OF THE LICENSE. A copy of the License is
*    provided with the Original Code and Modifications, and is also
*    available at www.sybase.com/developer/opensource.
*
*    The Original Code and all software distributed under the License are
*    distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
*    EXPRESS OR IMPLIED, AND SYBASE AND ALL CONTRIBUTORS HEREBY DISCLAIM
*    ALL SUCH WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF
*    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR
*    NON-INFRINGEMENT. Please see the License for the specific language
*    governing rights and limitations under the License.
*
*  ========================================================================
*
* Description:  WHEN YOU FIGURE OUT WHAT THIS FILE DOES, PLEASE
*               DESCRIBE IT HERE!
*
****************************************************************************/


#include <stdlib.h>
#include <stddef.h>
#include "sortlist.h"

typedef struct x {
    int i;
    struct x *next;
} x;

int compare( x **a, x **b )
{
    return( (*a)->i - (*b)->i );
}

void *myalloc( size_t size )
{
    if( size > 50 )
        return( NULL );
    return( malloc( size ) );
}

void main( void )
{
    x   *head,*new;

    int         i;

    head = NULL;
    for( i = 0; i < 100; ++i ) {
        new = malloc( sizeof( *new ) );
        new->next = head;
        new->i = rand();
        head = new;
    }
    printf( "before " );
    for( new = head; new != NULL; new = new->next ) {
        printf( "%d ", new->i );
    }
    printf( "\n" );
    head = SortLinkedList( head, offsetof( x, next ), compare, myalloc, free );
    printf( "after " );
    for( new = head; new != NULL; new = new->next ) {
        printf( "%d ", new->i );
    }
    printf( "\n" );
}
